Look-ahead strategies for dynamic pickup and delivery problems
نویسندگان
چکیده
منابع مشابه
Look-ahead strategies for dynamic pickup and delivery problems
In this paper we consider a dynamic full truckload pickup and delivery problem with time-windows. Jobs arrive over time and are offered in a second-price auction. Individual vehicles bid on these jobs and maintain a schedule of the jobs they have won. We propose a pricing and scheduling strategy based on dynamic programming where not only the direct costs of a job insertion are taken into accou...
متن کاملDynamic pickup and delivery problems
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real time. It discusses some general issues as well as solution strategies.
متن کاملDynamic location problems with limited look-ahead
The following problem arose in connection with studies of Internet web page caching. The general setting is as follows: In some fixed metric space M , k “servers” S1, . . . , Sk are given with some arbitrary initial locations in M . Requests for service at certain points σ1, σ2, σ3, . . . , σN , in M arrive over time. Immediately after request σt is received, exactly one of several mutually exc...
متن کاملMultiobjective model predictive control for dynamic pickup and delivery problems
A multiobjective-model-based predictive control approach is proposed to solve a dynamic pickup and delivery problem in the context of a potential dial-a-ride service implementation. A dynamic objective function including two relevant dimensions, user and operator costs, is considered. Because these two components typically have opposing goals, the problem is formulated and solved using multiobj...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OR Spectrum
سال: 2008
ISSN: 0171-6468,1436-6304
DOI: 10.1007/s00291-008-0146-3